DPLL algorithm

Results: 33



#Item
21Solving Non-clausal Formulas with DPLL search Christian Thiffault1 , Fahiem Bacchus1 , and Toby Walsh 2   1 Department of Computer Science, University of Toronto, Toronto, Ontario, Canada

Solving Non-clausal Formulas with DPLL search Christian Thiffault1 , Fahiem Bacchus1 , and Toby Walsh 2   1 Department of Computer Science, University of Toronto, Toronto, Ontario, Canada

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2004-07-03 23:15:04
22Refutation-Complete Binary Decision Diagrams  Scott P. Sanner Department of Computer Science University of Toronto Toronto, ON M5S 3G4

Refutation-Complete Binary Decision Diagrams Scott P. Sanner Department of Computer Science University of Toronto Toronto, ON M5S 3G4

Add to Reading List

Source URL: users.cecs.anu.edu.au

Language: English - Date: 2004-05-05 19:58:06
23EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2

EagleUP: Solving Random 3-SAT using SLS with Unit Propagation Oliver Gableske1 and Marijn Heule2 1 2

Add to Reading List

Source URL: www.st.ewi.tudelft.nl

Language: English - Date: 2011-09-26 11:40:37
24Improving Parallel Local Search for SAT Alejandro Arbelaez1 , Youssef Hamadi2,3 1 Microsoft-INRIA joint-lab, Orsay France [removed]

Improving Parallel Local Search for SAT Alejandro Arbelaez1 , Youssef Hamadi2,3 1 Microsoft-INRIA joint-lab, Orsay France [removed]

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2010-12-07 07:14:51
25Journal on Satisfiability, Boolean Modeling and Computation[removed]  ManySAT: a Parallel SAT Solver Youssef Hamadi  [removed]

Journal on Satisfiability, Boolean Modeling and Computation[removed] ManySAT: a Parallel SAT Solver Youssef Hamadi [removed]

Add to Reading List

Source URL: www.cril.univ-artois.fr

Language: English - Date: 2009-12-08 06:37:10
26Annales Mathematicae et Informaticae[removed]pp. 9–21 http://ami.ektf.hu Cube-and-Conquer approach for SAT solving on grids∗

Annales Mathematicae et Informaticae[removed]pp. 9–21 http://ami.ektf.hu Cube-and-Conquer approach for SAT solving on grids∗

Add to Reading List

Source URL: ami.ektf.hu

Language: English - Date: 2013-12-20 13:48:28
27i  i “p01c04˙cds” — [removed] — 10:12 — page 131 — #1  i

i i “p01c04˙cds” — [removed] — 10:12 — page 131 — #1 i

Add to Reading List

Source URL: gauss.ececs.uc.edu

Language: English - Date: 2011-07-05 08:44:49
28Extracting a DPLL Algorithm

Extracting a DPLL Algorithm

Add to Reading List

Source URL: www-compsci.swan.ac.uk

Language: English - Date: 2012-10-25 13:49:14
29SAT Encodings Sugar Nonogram OSS Summary  .

SAT Encodings Sugar Nonogram OSS Summary .

Add to Reading List

Source URL: bach.istc.kobe-u.ac.jp

Language: English - Date: 2010-04-19 00:19:44
30B-Cubing: New Possibilities for Efficient SAT-Solving Domagoj Babi´c, Student Member, IEEE, Jesse Bingham, Student Member, IEEE, and

B-Cubing: New Possibilities for Efficient SAT-Solving Domagoj Babi´c, Student Member, IEEE, Jesse Bingham, Student Member, IEEE, and

Add to Reading List

Source URL: www.domagoj-babic.com

Language: English - Date: 2008-08-13 18:39:15